Self-Organizing Ant-based Information Gossiping Algorithm for P2P Networks

نویسندگان

  • Christophe Guéret
  • Nicolas Monmarché
  • Mohamed Slimane
چکیده

They appeared in our life only few years ago and now they are everywhere: computers have become ubiquitous and, almost, irreplaceable. Classical ways of creating, managing and exchanging information have been progressively replaced by electronic means. Everyday, information diffusion tools like the World Wide Web, E-mails, Forums and other Blog software are now commonly used. In spite of this plebiscite, computer based information managing still suffers some weaknesses. Compared with communications between attendees of a meeting, information exchanges over the Internet can appear to be very poor. Mainly, software aimed to do CSCW (Computer Supported Collaborative Work) can be blamed for requiring the user to do an effort to use them. Also, being able to communicate with a lot of people does not really ease the task of recipients selection for a user willing to share information. In this paper we present an algorithm aimed at perform autonomous selective dissemination of messages within a network. It constitutes the communication layer of our framework called PIAF (”Personal Intelligent Agent Framework”) which is intended to help users transparently share information. This algorithm works in a fully decentralized way, using epidemic diffusion mechanism and artificial ants paradigm to achieve self-organization and information flows management. A self-organizing ant-based information gossiping algorithm for P2P networks Christophe Guéret, Nicolas Monmarché, and Mohamed Slimane Université François-Rabelais de Tours, Laboratoire d’Informatique, Polytech’Tours, 64 avenue Jean Portalis 37200 Tours, France {gueret,monmarche,slimane}@univ-tours.fr Abstract. They appeared in our life only few years ago and now they are everywhere: computers have become ubiquitous and, almost, irreplaceable. Classical ways of creating, managing and exchanging information have been progressively replaced by electronic means. Everyday, information diffusion tools like the World Wide Web, E-mails, Forums and other Blog software are now commonly used. In spite of this plebiscite, computer based information managing still suffers some weaknesses. Compared with communications between attendees of a meeting, information exchanges over the Internet can appear to be very poor. Mainly, software aimed to do CSCW (Computer Supported Collaborative Work) can be blamed for requiring the user to do an effort to use them. Also, being able to communicate with a lot of people does not really ease the task of recipients selection for a user willing to share information. In this paper we present an algorithm aimed at perform autonomous selective dissemination of messages within a network. It constitutes the communication layer of our framework called PIAF (”Personal Intelligent Agent Framework”) which is intended to help users transparently share information. This algorithm works in a fully decentralized way, using epidemic diffusion mechanism and artificial ants paradigm to achieve self-organization and information flows management. They appeared in our life only few years ago and now they are everywhere: computers have become ubiquitous and, almost, irreplaceable. Classical ways of creating, managing and exchanging information have been progressively replaced by electronic means. Everyday, information diffusion tools like the World Wide Web, E-mails, Forums and other Blog software are now commonly used. In spite of this plebiscite, computer based information managing still suffers some weaknesses. Compared with communications between attendees of a meeting, information exchanges over the Internet can appear to be very poor. Mainly, software aimed to do CSCW (Computer Supported Collaborative Work) can be blamed for requiring the user to do an effort to use them. Also, being able to communicate with a lot of people does not really ease the task of recipients selection for a user willing to share information. In this paper we present an algorithm aimed at perform autonomous selective dissemination of messages within a network. It constitutes the communication layer of our framework called PIAF (”Personal Intelligent Agent Framework”) which is intended to help users transparently share information. This algorithm works in a fully decentralized way, using epidemic diffusion mechanism and artificial ants paradigm to achieve self-organization and information flows management.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Novel Caching Strategy in Video-on-Demand (VoD) Peer-to-Peer (P2P) Networks Based on Complex Network Theory

The popularity of video-on-demand (VoD) streaming has grown dramatically over the World Wide Web. Most users in VoD P2P networks have to wait a long time in order to access their requesting videos. Therefore, reducing waiting time to access videos is the main challenge for VoD P2P networks. In this paper, we propose a novel algorithm for caching video based on peers' priority and video's popula...

متن کامل

Unstructured P2P Search Mechanism Based on Ant Colony Optimization

Though flooding-based search mechanism has been used extensively in unstructured peer-to-peer network such as Gnutella, the mechanism is not scalable and as a consequence, it consumes a high amount bandwidths and resources. Because of the strong similarities between self-organizing behaviors of ant colonies and self-organization communications in P2P networks, a search algorithm based on Ant Co...

متن کامل

A Novel Caching Strategy in Video-on-Demand (VoD) Peer-to-Peer (P2P) Networks Based on Complex Network Theory

The popularity of video-on-demand (VoD) streaming has grown dramatically over the World Wide Web. Most users in VoD P2P networks have to wait a long time in order to access their requesting videos. Therefore, reducing waiting time to access videos is the main challenge for VoD P2P networks. In this paper, we propose a novel algorithm for caching video based on peers' priority and video's popula...

متن کامل

GGRA: a grouped gossip-based reputation aggregation algorithm

An important issue in P2P networks is the existence of malicious nodes that decreases the performance of such networks. Reputation system in which nodes are ranked based on their behavior, is one of the proposed solutions to detect and isolate malicious (low ranked) nodes. Gossip Trust is an interesting previously proposed algorithm for reputation aggregation in P2P networks based on t...

متن کامل

Heuristics for Uninformed Search Algorithms in Unstructured P2P Networks Inspired by Self-Organizing Social Insect Models

We consider the problem of rapidly searching for resources or files in a distributed, unstructured, peer-to-peer file sharing network. Unstructured p2p network protocols such as Gnutella use a flooding-based mechanism for resource searching that generates considerable traffic in the network for each search query. When the searching activity by users in a p2p network is high, the traffic generat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010